Boolean minimization and algebraic factorization procedures for fully testable sequential machines
نویسندگان
چکیده
منابع مشابه
A unified approach to the synthesis of fully testable sequential machines
• In this paper we attempt to unify and extend the various approaches to synthesizing fully S testable sequential circuits that can be modeled as finite state machines (FSMs). We first identify classes of redundancies and isolate equivalent-state redundancies as those most difficult to eliminate. We then show that the essential problem behind equivalent-state redundancies is the creation of val...
متن کاملIrredundant sequential machines via optimal logic synthesis
optimal sequential logic synthesis can produce fallv testable nonscan finite state machines. Test generation algorithms can be used It is well known that optimal logic synthesis can ensure fully to remove all the redundancies in sequential machines resulting in testable combinational logic designs. In this paper. we show that fuily testable designs. However. in general. this method requires opt...
متن کاملEasily testable PLA-based finite state machines
the area and timing penalty associated with LSSD techniques are not acceptable to designers. In this paper, we outline a synthesis procedure, which Logic synthesis and minimization techniques can, in beginning from a State Transition Graph description principle, ensure fully and easily testable combinational of a sequential machine, produces an optimized easily and sequential circuit designs. I...
متن کاملCompact and Testable Circuits for Regular Functions
We propose a new synthesis approach based on the SPP three-level logic minimization of D-reducible Boolean functions. This approach supplies a new tool for efficient minimization, based on the idea of exploiting a Boolean function regularity to get more compact expressions. D-reducible functions can be efficiently synthesized giving rise to new four-level logic forms called DRedSPP. These forms...
متن کاملMinimal realization of sequential machines : the method of maximal adjacencies
Reducing the amount of hardware needed for implementing a sequential machine is very important. The problem of, in the strict sense, minimal realization of sequential machines is difficult and it is entirely unsolved (except complete enumeration). Typically, this problem can be replaced with a number of subproblems such as: state minimization, state assignment, choice of flip-flops and minimiza...
متن کامل